Two Short Presentations for Lyons' Sporadic Simple Group

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Completing the Brauer Trees for the Sporadic Simple Lyons Group

In this paper we complete the Brauer trees for the sporadic simple Lyons group Ly in characteristics 37 and 67. The results are obtained using tools from computational representation theory, in particular a new condensation technique, and with the assistance of the computer algebra systems MeatAxe and GAP.

متن کامل

Semi-Presentations for the Sporadic Simple Groups

A semi-presentation for a group G is a set of relations which characterises a set of generators of G up to automorphism. We discuss some techniques for finding semi-presentations and illustrate them by exhibiting semi-presentations on standard generators for the 26 sporadic simple groups and their automorphism groups. We then show how these semipresentations were used to check the data in the W...

متن کامل

Ten simple rules for short and swift presentations

Scientific communication is an independent research domain and has become a fundamental component of most scientific discourse and all public outreach. It now comprises a set of critical activities for many research programs [1, 2], including those that directly influence global and human health [3]. Scientific communication has evolved because it does not have to happen only at the final stage...

متن کامل

Integral Group Ring of the Suzuki Sporadic Simple Group

Using the Luthar–Passi method, we investigate the classical Zassenhaus conjecture for the normalized unit group of the integral group ring of the Suzuki sporadic simple group Suz. As a consequence, for this group we confirm the Kimmerle’s conjecture on prime graphs.

متن کامل

Short Presentations for Finite Groups

We conjecture that every nite group G has a short presentation (in terms of generators and relations) in the sense that the total length of the relations is (log jGj) O(1). We show that it suuces to prove this conjecture for simple groups. Motivated by applications in computational complexity theory, we conjecture that for nite simple groups, such a short presentation is computable in polynomia...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Experimental Mathematics

سال: 2000

ISSN: 1058-6458,1944-950X

DOI: 10.1080/10586458.2000.10504410